var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:MDC&jsonp=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:MDC&jsonp=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fresearch.seas.ucla.edu%2Flicos%2Ffiles%2F2023%2F02%2Fpublicactions_v1.bib&authorFirst=1&nocache=1&fullnames=1&theme=bullets&group0=year&group1=type&owner={}&filter=tags:MDC&jsonp=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2010\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Y. Li; C. Tian; S N. Diggavi; M. Chiang; and A. R. Calderbank.\n\n\n \n \n \n \n Network Resource Allocation for Competing Multiple-Description Transmissions.\n \n \n \n\n\n \n\n\n\n IEEE Transactions on Communications, 58(5): 1493–1504. MAY 2010.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{LTDCCj10,\n abstract = {We study end-to-end network utility maximization (NUM) approach to allocate\nresources to multiple flows, each encoding multiple description data compression streams,\nby taking into account the end-to-end distortion measures.},\n author = {Y. Li and C. Tian and S N. Diggavi and M. Chiang and  A. R. Calderbank},\n file = {:papers:competingmd_final.pdf},\n journal = {IEEE Transactions on Communications},\n month = {MAY},\n note = {},\n number = {5},\n pages = {1493--1504},\n tags = {journal,MDnum,NDC,MDC},\n title = {Network Resource Allocation for Competing Multiple-Description Transmissions},\n type = {2},\n volume = {58},\n year = {2010}\n}\n\n
\n
\n\n\n
\n We study end-to-end network utility maximization (NUM) approach to allocate resources to multiple flows, each encoding multiple description data compression streams, by taking into account the end-to-end distortion measures.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2009\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n J. Chen; C. Tian; and S N. Diggavi.\n\n\n \n \n \n \n Multiple Description Coding for Stationary Sources.\n \n \n \n\n\n \n\n\n\n IEEE Transactions on Information Theory, 55(6): 2868–2881. June 2009.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{CTDj10,\n abstract = {We characterize the rate region of the two-description multiple description coding for stationary Gaussian sources under the squared error distortion measure.},\n author = {J. Chen and C. Tian and  S N. Diggavi},\n file = {:papers:it_mdstationary_submitted.pdf},\n journal = {IEEE Transactions on Information Theory},\n month = {June},\n note = {},\n number = {6},\n pages = {2868--2881},\n tags = {journal,StatMDC,NDC,IT,MDC},\n title = {Multiple Description Coding for Stationary Sources},\n type = {2},\n volume = {55},\n year = {2009}\n}\n\n
\n
\n\n\n
\n We characterize the rate region of the two-description multiple description coding for stationary Gaussian sources under the squared error distortion measure.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2008\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n C. Tian; J. Chen; and S N. Diggavi.\n\n\n \n \n \n \n \n Multiuser successive refinement and multiple description coding.\n \n \n \n \n\n\n \n\n\n\n IEEE Transactions on Information Theory, 54(2): 921–931. February 2008.\n \n\n\n\n
\n\n\n\n \n \n \"Multiuser arxiv\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{TCDj08,\n abstract = {We study the multi-user successive refinement problem (posed in Pradhan and Ramchandran, 2002), where the users are connected to a central server through links with different noiseless capacities. Each user requires to reconstruct the source in a scalable manner. We provide the best known achievable strategy for the two-user, two-layer case and the complete characterization of the rate-distortion region for the Gaussian source under the mean-squared error (MSE) distortion measure.},\n author = {C. Tian and J. Chen and S N. Diggavi,},\n file = {:papers:multiusersr.pdf},\n journal = {IEEE Transactions on Information Theory},\n label = {tcd_j08},\n month = {February},\n note = {},\n number = {2},\n pages = {921--931},\n tags = {journal,RDSI,NDC,RDmultiserSucRef,IT,MDC},\n title = {Multiuser successive refinement and multiple description coding},\n type = {2},\n url_arxiv = {http://arxiv.org/abs/0707.4133},\n volume = {54},\n year = {2008}\n}\n\n
\n
\n\n\n
\n We study the multi-user successive refinement problem (posed in Pradhan and Ramchandran, 2002), where the users are connected to a central server through links with different noiseless capacities. Each user requires to reconstruct the source in a scalable manner. We provide the best known achievable strategy for the two-user, two-layer case and the complete characterization of the rate-distortion region for the Gaussian source under the mean-squared error (MSE) distortion measure.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n Y. Li; C. Tian; S N. Diggavi; M. Chiang; and A. R. Calderbank.\n\n\n \n \n \n \n Network Resource Allocation for Competing Multiple-Description Transmissions.\n \n \n \n\n\n \n\n\n\n In IEEE Globecom, New Orleans, pages 1-6, November 2008. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{LTDCCj08,\n author = {Y. Li and C. Tian and S N. Diggavi and M. Chiang and A. R. Calderbank},\n booktitle = {IEEE Globecom, New Orleans},\n month = {November},\n note = {},\n pages = {1-6},\n tags = {conf,MDnum,NDC,MDC},\n title = {Network Resource Allocation for Competing Multiple-Description Transmissions},\n type = {4},\n year = {2008}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2007\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n J. Chen; C. Tian; and S N. Diggavi.\n\n\n \n \n \n \n Multiple description coding for stationary sources.\n \n \n \n\n\n \n\n\n\n In IEEE Data Compression Conference (DCC), Snowbird, Utah, pages 73–82, 2007 2007. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{CTDj07,\n author = {J. Chen and C. Tian and S N. Diggavi,},\n booktitle = { IEEE Data Compression Conference (DCC), Snowbird, Utah},\n month = {2007},\n note = {},\n pages = {73--82},\n tags = {conf,StatMDC,NDC,IT,MDC},\n title = {Multiple description coding for stationary sources},\n type = {4},\n year = {2007}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2006\n \n \n (2)\n \n \n
\n
\n \n \n
\n
\n  \n 3\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S N. Diggavi.\n\n\n \n \n \n \n Diversity in Communication: From source coding to wireless networks.\n \n \n \n\n\n \n\n\n\n Diversity in Communication: From source coding to wireless networks, pages 243–286. Simon Haykin, Jose Principe, Terry Sejnowski, and John McWhirter, MIT Press edition, 2006.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inbook{Dib06,\n abstract = {This paper brings together how diversity plays a role in diverse topics like\nsource coding, physical layer wireless communication and mobility in wireless networks.},\n author = {S N. Diggavi},\n booktitle = {Brain and Systems: New Directions in Statistical Signal Processing},\n edition = {Simon Haykin, Jose Principe, Terry Sejnowski, and John McWhirter, MIT Press},\n file = {:papers:divincomm.pdf},\n label = {d_b06},\n pages = {243--286},\n series = {},\n tags = {BookChap,DivInComm,STcodes,MDC,WiNet},\n title = {Diversity in Communication: From source coding to wireless networks},\n type = {3},\n volume = {},\n year = {2006}\n}\n\n
\n
\n\n\n
\n This paper brings together how diversity plays a role in diverse topics like source coding, physical layer wireless communication and mobility in wireless networks.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n C. Tian; J. Chen; and S N. Diggavi.\n\n\n \n \n \n \n Multiuser successive refinement and multiple description coding.\n \n \n \n\n\n \n\n\n\n In IEEE Information Theory Workshop (ITW), Chengdu, China, pages 293–297, October 2006. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{TCDj06,\n author = { C. Tian and J. Chen and S N. Diggavi},\n booktitle = {IEEE   Information Theory Workshop (ITW), Chengdu, China},\n month = {October},\n note = {},\n pages = {293--297},\n tags = {conf,RDSI,NDC,RDmultiserSucRef,IT,MDC},\n title = {Multiuser successive refinement and multiple description coding},\n type = {4},\n year = {2006}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2004\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S N. Diggavi; and V A. Vaishampayan.\n\n\n \n \n \n \n On multiple description source coding with decoder side information.\n \n \n \n\n\n \n\n\n\n In IEEE Information Theory Workshop (ITW), San Antonio, October 2004. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DVj04,\n abstract = {We formulate a multi-terminal source coding\nproblem, where we are required to construct a multiple description\nsource code for a source sequence when side information\nabout dependent random processes is available at the decoder\nonly, or at both the decoder and the encoder. We describe\nan achievable rate-distortion region for these problems. In the quadratic Gaussian\ncase, and when there is common side information among\nthe decoders, we show that the rate region when both the encoder\nand decoder have access to the side information coincides\nwith that of decoder–only side information. This is analogous\nto the single-description (Wyner-Ziv) case, and an explicit\ncharacterization of the rate-distortion region is provided\nfor this case.},\n author = {S N. Diggavi and V A. Vaishampayan},\n booktitle = {IEEE   Information Theory Workshop (ITW), San Antonio},\n file = {:papers:ps:mdsi.pdf},\n month = {October},\n note = {},\n pages = {},\n tags = {conf,RDSI,NDC,IT,MDC,SelConf},\n title = {On multiple description source coding with decoder side information},\n type = {4},\n year = {2004}\n}\n\n
\n
\n\n\n
\n We formulate a multi-terminal source coding problem, where we are required to construct a multiple description source code for a source sequence when side information about dependent random processes is available at the decoder only, or at both the decoder and the encoder. We describe an achievable rate-distortion region for these problems. In the quadratic Gaussian case, and when there is common side information among the decoders, we show that the rate region when both the encoder and decoder have access to the side information coincides with that of decoder–only side information. This is analogous to the single-description (Wyner-Ziv) case, and an explicit characterization of the rate-distortion region is provided for this case.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2002\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 2\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S N. Diggavi; N J A. Sloane; and V A. Vaishampayan.\n\n\n \n \n \n \n Asymmetric Multiple Description Lattice Vector Quantizers.\n \n \n \n\n\n \n\n\n\n IEEE Transactions on Information Theory, 48(1): 174–191. January 2002.\n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n  \n \n abstract \n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@article{DSVj02,\n abstract = {This designs asymmetric multiple description lattice quantizers, which covers\nthe entire range of the distortion profile, from symmetric to successive refinement. We present a solution to the labeling problem, which is an important part of the construction. We show that this construction is optimal in the high-rate regime, by comparing it to the information-theoretic bounds.},\n author = {S N. Diggavi and N J A. Sloane and V A. Vaishampayan},\n file = {:papers:ps:final_mdc.pdf},\n journal = {IEEE Transactions on Information Theory},\n month = {January},\n note = {},\n number = {1},\n pages = {174--191},\n tags = {journal,NDC,IT,MDC,LatticeSrc},\n title = {Asymmetric Multiple Description Lattice Vector Quantizers},\n type = {2},\n volume = {48},\n year = {2002}\n}\n\n
\n
\n\n\n
\n This designs asymmetric multiple description lattice quantizers, which covers the entire range of the distortion profile, from symmetric to successive refinement. We present a solution to the labeling problem, which is an important part of the construction. We show that this construction is optimal in the high-rate regime, by comparing it to the information-theoretic bounds.\n
\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n
\n
\n  \n 2000\n \n \n (1)\n \n \n
\n
\n \n \n
\n
\n  \n 4\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n S N. Diggavi; N J A. Sloane; and V. A. Vaishampayan.\n\n\n \n \n \n \n Design of Asymmetric Multiple Description Lattice Vector Quantizers.\n \n \n \n\n\n \n\n\n\n In IEEE Data Compression Conference (DCC),Snowbird, Utah, pages 490–499, March 2000. \n \n\n\n\n
\n\n\n\n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@inproceedings{DSVj00,\n author = {S N. Diggavi and N J A. Sloane and V. A. Vaishampayan},\n booktitle = {IEEE Data Compression Conference (DCC),Snowbird, Utah},\n month = {March},\n note = {},\n pages = {490--499},\n tags = {conf,NDC,IT,MDC,LatticeSrc},\n title = {Design of Asymmetric Multiple Description Lattice Vector Quantizers},\n type = {4},\n year = {2000}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);